Minimizing total completion time on a single machine with step improving jobs

Minimizing total completion time on a single machine with step improving jobs Open

Production systems often experience a shock or a technological change, resulting in performance improvement. In such settings, job processing times become shorter if jobs start processing at, or after, a common critical date. This paper considers a single machine scheduling problem with step-improving processing times, where the effects are job-dependent. The objective is to minimize the total ...

Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs

In this paper, we study a scheduling problem of minimizing the total completion time on a single machine where the processing time of a job is a step function of its starting time and a due date that is common to all jobs. This problem has been shown to be NP-hard in the literature. To derive optimal solutions from a practical aspect, we develop a lower bound and two elimination rules to design...

Minimizing Makespan and Total Completion Time Criteria on a Single Machine with Release Dates

1 Department of Computer Science University for Development Studies, Ghana 2 Department of Industrial and Production Engineering University of Ibadan, Nigeria Corresponding Author: E. O. Oyetunji _________________________________________________________________________________________________ Abstract This paper considers the scheduling problem of simultaneously minimizing the makespan and tota...

Minimizing Class-Based Completion Time Variance on a single machine

⎯We consider the problem of scheduling a set of simultaneously available jobs on a single machine. The objective is to determine a schedule that minimizes the class-based completion time variance (CB-CTV) of the jobs while reducing the overall CTV is taken as the secondary objective. This non-regular performance measure is closely related to service stability and of practical significance in ma...

Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts